Polyhedral representation of discrete Morse functions
نویسندگان
چکیده
منابع مشابه
Polyhedral representation of discrete Morse functions
It is proved that every discrete Morse function in the sense of Forman on a finite regular CW complex can be represented by a polyhedral Morse function in the sense of Banchoff on an appropriate embedding in Euclidean space of the barycentric subdivision of the CW complex; such a representation preserves critical points. The proof is stated in terms of discrete Morse functions on posets.
متن کاملPolyhedral Representation of Discrete Morse Functions on Regular Cw Complexes and Posets Preliminary Draft
It is proved that the critical cells of a discrete Morse function in the sense of Forman on a finite regular CW complex can always be detected by a polyhedral Morse function in the sense of Banchoff on an appropriate embedding in Euclidean space of the barycentric subdivision of the complex. The proof is stated in terms of discrete Morse functions on a class of posets that is slightly broader t...
متن کاملConstructing discrete Morse functions
Morse theory has been considered a powerful tool in its applications to computational topology, computer graphics and geometric modeling. It was originally formulated for smooth manifolds. Recently, Robin Forman formulated a version of this theory for discrete structures such as cell complexes. It opens up several categories of interesting objects (particularly meshes) to applications of Morse ...
متن کاملOn Optimizing Discrete Morse Functions
In 1998, Forman introduced discrete Morse theory as a tool for studying CW complexes by producing smaller, simpler-to-understand complexes of critical cells with the same homotopy types as the original complexes. This paper addresses two questions: (1) under what conditions may several gradient paths in a discrete Morse function simultaneously be reversed to cancel several pairs of critical cel...
متن کاملComputing Optimal Discrete Morse Functions
The essential structural information of discrete Morse functions is captured by so-called Morse matchings. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present first polyhedral results for the corresponding polytope and report on some preliminary computational results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.02.020